Outer Model Satisfiability

نویسنده

  • M. C. Stanley
چکیده

This paper solves the anticharacterization problem first identified in [S1]. Perhaps the most striking instance of this problem is that, working relative to just ZFC, there is no uniform first-order definition of the family of subsets of ω 2 that have a closed unbounded (club) subset in some ω 1 and ω 2 preserving outer model. Other examples concern large homogeneous sets for partitions and cofinal branches through trees, as well as the club susbet problem at successors of singular cardinals, cf. [S2] and [S3]. The same phenominon has been considered from a different perspective by S. Fried-man, cf. Theorem 7.28 in [F]. A consequence of the main theorem of this paper is that over a sufficiently non-minimal model of ZFC + " Ramsey cardinals are definably stationary, " all of these characterization problems are solvable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese [24]. We prove that the following problem is decidable: Input: (i) A monadic second order logic sentence α, and (ii) a sentence β in the two-variable fragment of first order logic extended with counting quantifiers. The vocabularies of α...

متن کامل

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable

The two-variable fragment, henceforth denoted L, is the fragment of firstorder logic with equality but without function-symbols, in which only two logical variables may appear. It is well-known that L has the finite model property, and that its satisfiability (= finite satisfiability) problem is NEXPTIME-complete [3]. It follows that it is impossible, within L, to express the condition that a g...

متن کامل

Outer and Inner Confidence Intervals Based on Extreme Order Statistics in a Proportional Hazard Model

Let Mi and Mi be the maximum and minimum of the ith sample from k independent sample with different sample sizes, respectively. Suppose that the survival distribution function of the ith sample is F ̄i = F ̄αi, where αi is known and positive constant. It is shown that how various exact non-parametric inferential proce- ′ dures can be developed on the basis of Mi’s and Mi ’s for distribution ...

متن کامل

ATL* Satisfiability Is 2EXPTIME-Complete

The two central decision problems that arise during the design of safety critical systems are the satisfiability and the model checking problem. While model checking can only be applied after implementing the system, satisfiability checking answers the question whether a system that satisfies the specification exists. Model checking is traditionally considered to be the simpler problem – for br...

متن کامل

Elliptic Approximations of Propositional Formulae

A propositional formula can be approximated by a concave quadratic function. This approximation is obtained as a second order Taylor expansion of a convex smooth model. It is shown that in the 3-SAT case, the involved parameters can be set to such values that yield optimal discriminative properties. Two concentric (generally elliptic) quadratic convex regions are established, the inner one cont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008